A NOTE ON THE COMPLETENESS OF KOZEN’S AXIOMATISATION OF THE PROPOSITIONAL ì-CALCULUS
نویسنده
چکیده
The propositional ì-calculus is an extension of the modal system K with a least fixpoint operator. Kozen posed a question about completeness of the axiomatisation of the logic which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete. §
منابع مشابه
A Syntactical Treatment of Simultaneous Fixpoints in the Modal μ-Calculus
We provide a purely syntactical treatment of simultaneous fixpoints in the modal μ-calculus by proving directly in Kozen’s axiomatisation their properties as greatest and least fixpoints, that is, the fixpoint axiom and the induction rule. Further, we apply our result in order to get a completeness result for characteristic formulae of finite pointed transition systems.
متن کاملCompleteness of Kozen's Axiomatisation of the Propositional mu-Calculus
Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of the axiomatisation which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.
متن کاملA Complete Deductive System for the μ-Calculus
The propositional μ-calculus as introduced by Kozen in [12] is considered. In that paper a finitary axiomatisation of the logic was presented but its completeness remained an open question. Here a different finitary axiomatisation of the logic is proposed and proved to be complete. The two axiomatisations are compared.
متن کاملSequent Calculi for the Modal µ-Calculus over S5
We present two sequent calculi for the modal μ-calculus over S5 and prove their completeness by using classical methods. One sequent calculus has an analytical cut rule and could be used for a decision procedure the other uses a modified version of the induction rule. We also provide a completeness theorem for Kozen’s Axiomatisation over S5 without using the completeness result established by W...
متن کاملA Hilbert-Style Axiomatisation for Equational Hybrid Logic
This paper introduces an axiomatisation for equational hybrid logic based on previous axiomatizations and natural deduction systems for propositional and firstorder hybrid logic. Its soundness and completeness is discussed. This work is part of a broader research project on the development a general proof calculus for hybrid logics.
متن کامل